(H, k) stable graphs with minimum size
نویسندگان
چکیده
Let us call a G (H, k) graph vertex stable if it contains a subgraph H ever after removing any of its k vertices. By Q(H, k) we will denote the minimum size of an (H, k) vertex stable graph. In this paper, we are interested in finding Q(C3, k), Q(C4, k), Q(K1,p, k) and Q(Ks, k).
منابع مشابه
(H, k) STABLE BIPARTITE GRAPHS WITH MINIMUM SIZE
Let us call a graph G (H ; k) vertex stable if it contains a subgraph H after removing any of its k vertices. In this paper we are interested in finding the (Kn,n+1; 1) (respectively (Kn,n; 1)) vertex stable graphs with minimum size.
متن کاملOn vertex stability with regard to complete bipartite subgraphs
A graph G is called (H; k)-vertex stable if G contains a subgraph isomorphic to H ever after removing any of its k vertices. Q(H; k) denotes the minimum size among the sizes of all (H; k)-vertex stable graphs. In this paper we complete the characterization of (Km,n; 1)vertex stable graphs with minimum size. Namely, we prove that for m ≥ 2 and n ≥ m + 2, Q(Km,n; 1) = mn+m+n and Km,n ∗K1 as well ...
متن کاملOn (Kq;k)-Stable Graphs
A graph G is called (H; k)-vertex stable if G contains a subgraph isomorphic to H even after removing any k of its vertices. By stab(H; k) we denote the minimum size among the sizes of all (H; k)-vertex stable graphs. Given an integer q ≥ 2, we prove that, apart of some small values of k, stab(Kq; k) = (2q−3)(k+1). This confirms in the affirmative the conjecture of Dudek et al. [(H, k) stable g...
متن کاملOn (Cn;k) Stable Graphs
A graph G is called (H; k)-vertex stable if G contains a subgraph isomorphic to H ever after removing any k of its vertices; stab(H; k) denotes the minimum size among the sizes of all (H; k)-vertex stable graphs. In this paper we deal with (Cn; k)vertex stable graphs with minimum size. For each n we prove that stab(Cn; 1) is one of only two possible values and we give the exact value for infini...
متن کاملGeneral lower bound on the size of (H;k)-stable graphs
A graph G is called (H; k)-vertex stable if G contains a subgraph isomorphic to H ever after removing any k of its vertices. By stab(H; k) we denote the minimum size among the sizes of all (H; k)-vertex stable graphs. In this paper we present a first (non-trivial) general lower bound for stab(H; k) with regard to the order, connectivity and minimum degree of H. This bound is nearly sharp for k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 28 شماره
صفحات -
تاریخ انتشار 2008